A polynomial transform for matching pairs of weighted graphs
نویسندگان
چکیده
منابع مشابه
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملFPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights these lower bounds are asymptotically optimal. 2000 Mathematics Subject Classification: 05A15, 05C70, 15A52, 68Q10.
متن کاملTypicality Matching for Pairs of Correlated Graphs
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network deanonymization, study of biological data, web graphs, etc. An achievable region for successful matching is derived by analyzing a new matching algorithm that we r...
متن کاملA Dichromatic Polynomial for Weighted Graphs and Link Polynomials
A dichromatic polynomial for weighted graphs is presented. The Kauffman bracket of a signed graph, an invariant inspired by the Jones polynomial of a link in three-space, is shown to be essentially an evaluation of this dichromatic polynomial, as are the homfly polynomials of certain particular types of links. 1. THE DICHROMATIC POLYNOMIAL OF A WEIGHTED GRAPH In this note we use the term graph ...
متن کاملOn the matching polynomial of subdivision graphs
Let G be a simple graph and let S(G) be the subdivision graph of G, which is obtained from G by replacing each edge of G by a path of length two. In this paper, by the Principle of Inclusion and Exclusion we express the matching polynomial and Hosoya index of S(G) in terms of the matchings of G. Particularly, if G is a regular graph or a semi-regular bipartite graph, then the closed formulae of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1991
ISSN: 0307-904X
DOI: 10.1016/0307-904x(91)90011-d